Fuzzy implication can be arbitrarily complicated: A theorem

نویسندگان

  • Francisco G. Fernandez
  • Vladik Kreinovich
چکیده

| In fuzzy logic, there are several methods of representing implication in terms of &, _, and :; in particular, explicit representations deene a class of S implications, implicit representations deene a class of R implications. Some reasonable implication operations have been proposed, such as Yager's a b , that are diicult to represent as S or R implications. For such operations, a new class of representations has been recently proposed called A implications, for which the relationship between implications and the basic operations &, _, and : is even more complicated. A natural question is: is this complexity really necessary? In other words, is it true that A operations cannot be described as S or R ones, or they can, but we simply have not found these representations? In this paper, we show that yes, the complexity is necessary, because there are operations that cannot be represented in a simpler form. For every problem, be it medical, engineering, etc., we would like to use the best experts. Best experts are few, and it is impossible to use them for all practical problems. So, it is desirable to design computer-based systems that will use the knowledge of the best experts to make decisions comparable in quality with the decisions of these experts. Designing such expert systems is, therefore, an extremely important area of computer science. To develop an expert system, we must describe the expert knowledge in a way that a computer can use it. Expert knowledge, in addition to well-formulated precise statements about which experts are 100% sure, usually contains statements that are not 100% veriied, that are somehow more intuitive than precise. In other words, experts may have different degrees of belief in the statements that comprise their knowledge. Hence, when we describe expert statements, then instead of simply classifying them as \true" or \false" (i.e., instead of using the traditional two-valued logic), we must describe the expert's degree of belief in these statements; this degree of belief may range from \absolutely sure" (that correspond to \true") to \absolutely wrong" (which corresponds to \false"), but in addition to these two extreme cases, there may be many intermediate degrees of belief that an expert expresses by words like \possi-ble", \most probable", etc. In other words, instead of a two-valued logic, we have a multi-valued logic, in which instead of a truth value that can take only two possible values, …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monitoring Fuzzy Capability Index $widetilde{C}_{pk}$ by Using the EWMA Control Chart with Imprecise Data

A manufacturing process cannot be released to production until it has been proven to be stable. Also, we cannot begin to talk about process capability until we have demonstrated stability in our process. This means that the process variation is the result of random causes only and all assignable or special causes have been removed. In complicated manufacturing processes, such as drilling proces...

متن کامل

TREND-CYCLE ESTIMATION USING FUZZY TRANSFORM OF HIGHER DEGREE

In this paper, we provide theoretical justification for the application of higher degree fuzzy transform in time series analysis. Under the assumption that a time series can be additively decomposed into a trend-cycle, a seasonal component and a random noise, we demonstrate that the higher degree fuzzy transform technique can be used for the estimation of the trend-cycle, which is one of the ba...

متن کامل

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

On Intuitionistic Fuzzy LI -ideals in Lattice Implication Algebras

In the present paper, the intuitionistic fuzzy LI -ideal theory in lattice implication algebras is further studied. Some new properties and equivalent characterizations of intuitionistic fuzzy LI -ideals are given. Representation theorem of intuitionistic fuzzy LI -ideal which is generated by an intuitionistic fuzzy set is established. It is proved that the set consisting of all intuitionistic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Intell. Syst.

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1998